On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic
نویسندگان
چکیده
This article investigates Krivine’s realizability interpretation of classical second-order arithmetic and its recent extension handling countable choice. We will start by presenting a two-step interpretation which first eliminates classical logic via a negative translation and then applies standard realizability interpretation. We then argue that a slight variant of Krivine’s interpretation corresponds to this two-step interpretation. This variant can be viewed as the continuation passing style variant of Krivine’s original interpretation, and as such uses standard λ-terms and avoids the use of new continuation constants in the interpretation of classical logic.
منابع مشابه
Krivine's classical realisability from a categorical perspective
In a sequence of papers (Krivine 2001; Krivine 2003; Krivine 2009) J.-L. Krivine has introduced his notion of Classical Realizability for classical second order logic and Zermelo-Fraenkel set theory. Moreover, in more recent work (Krivine 2008) he has considered forcing constructions on top of it with the ultimate aim of providing a realizability interpretation for the axiom of choice. The aim ...
متن کاملRealizability Interpretation and Normalization of Typed Call-by-Need $$\lambda$$-calculus With Control
We define a variant of Krivine realizability where realizers are pairs of a term and a substitution. This variant allows us to prove the normalization of a simply-typed call-by-need λ-calculus with control due to Ariola et al. Indeed, in such call-by-need calculus, substitutions have to be delayed until knowing if an argument is really needed. We then extend the proof to a call-by-need λ-calcul...
متن کاملA Realizability Interpretation for Classical Arithmetic
A constructive realizablity interpretation for classical arithmetic is presented, enabling one to extract witnessing terms from proofs of 1 sentences. The interpretation is shown to coincide with modified realizability, under a novel translation of classical logic to intuitionistic logic, followed by the Friedman-Dragalin translation. On the other hand, a natural set of reductions for classical...
متن کاملInteractive Realizability, Monads and Witness Extraction
In this dissertation we collect some results about “interactive realizability”, a realizability semantics that extends the Brouwer-Heyting-Kolmogorov interpretation to (sub-)classical logic, more precisely to first-order intuitionistic arithmetic (Heyting Arithmetic, HA) extended by the law of the excluded middle restricted to Σ1 formulas (EM1), a system motivated by its interest in proof minin...
متن کاملRealizability of the Axiom of Choice in HOL. (An Analysis of Krivine's Work)
This paper is an introduction to recent works in realizability, mainly Krivine’s work to realize the dependent choice axiom. We also show how to improve programs extracted from classical proofs by distinguishing formulas with and without algorithmic contents.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 84 شماره
صفحات -
تاریخ انتشار 2008